#!/usr/bin/env python

# -------------------------------
# projects/python#main.py
# Copyright (C) 2009
# Eric Shrewsberry and Daniel Treiber
# -------------------------------

# -------
# globals
# -------

p = 0 # input: don't change after reading
primes = [0,0,0,0]
#this array stores the 3 primes that equal the index  of the array, ex. 2+2+2= 6 (which is the index
#the biggest different between primes up to 10,000,000 is 159
primeDif = [[],[],[],[],[],[],[2,2,2],[2,2,3],[2,3,3],[3,3,3],[3,2,5],#first 10
            [5,3,3],[5,5,2],[5,5,3],[7,5,2],[11,2,2],[11,3,2],[13,2,2],[13,3,2],[13,3,3],[13,5,2],#11-20
            [17,2,2],[17,3,2],[19,2,2],[19,3,2],[19,3,3],[19,5,2],[23,2,2],[23,3,2],[23,3,3],[23,5,2],#21-30
            [23,5,3],[23,7,2],[29,2,2],[29,3,2],[31,2,2],[31,3,2],[31,3,3],[31,5,2],[31,5,3],[31,7,2],#31-40
            [37,2,2],[37,3,2],[37,3,3],[37,5,2],[41,2,2],[41,3,2],[43,2,2],[43,3,2],[43,3,3],[43,5,2],#41-50
            [47,2,2],[47,3,2],[47,3,3],[47,5,2],[47,5,3],[47,7,2],[53,2,2],[53,3,2],[53,3,3],[53,5,2],#51-60
            [53,5,3],[53,7,2],[59,2,2],[59,3,2],[61,2,2],[61,3,2],[61,3,3],[61,5,2],[61,5,3],[61,7,2],#61-70
            [67,2,2],[67,3,2],[67,3,3],[67,5,2],[71,2,2],[71,3,2],[73,2,2],[73,3,2],[73,3,3],[73,5,2],#71-80
            [73,5,3],[73,7,2],[79,2,2],[79,3,2],[79,3,3],[79,5,2],[83,2,2],[83,3,2],[83,3,3],[83,5,2],#81-90
            [83,5,3],[83,7,2],[89,2,2],[89,3,2],[89,3,3],[89,5,2],[89,5,3],[89,7,2],[89,7,3],[79,19,2],#91-100
            [97,2,2],[97,3,2],[97,3,3],[97,5,2],[101,2,2],[101,3,2],[103,2,2],[103,3,2],[103,3,3],[103,5,2],#101-110
            [107,2,2],[107,3,2],[109,2,2],[109,3,2],[109,3,3],[109,5,2],[113,2,2],[113,3,2],[113,3,3],[113,5,2],#111-120
            [113,5,3],[113,7,2],[113,7,3],[109,13,2],[113,7,5],[113,11,2],[113,11,3],[113,13,2],[113,13,3],[109,19,2],#121-130
            [127,2,2],[127,3,2],[127,3,3],[127,5,2],[131,2,2],[131,3,2],[131,3,3],[131,5,2],[131,5,3],[131,7,2],#131-140
            [137,2,2],[137,3,2],[139,2,2],[139,3,2],[139,3,3],[139,5,2],[139,5,3],[139,7,2],[139,7,3],[137,11,2],#141-150
            [139,7,5],[139,11,2],[149,2,2],[149,3,2],[151,2,2],[151,3,2],[151,3,3],[151,5,2],[151,5,3]];#151-159

#all the primes from 1 to the square root of 10,000,000
checkPrimes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,
             149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,
             293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,
             461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,
             641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,
             823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,
             1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,
             1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,
             1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,
             1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,
             1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,
             1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,
             1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,
             2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,
             2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,
             2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,
             2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,
             2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,
             3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137]


# -----------
# InputReader
# -----------

class InputReader (object) :
    def read (self) :
        return raw_input()

# ------------
# OutputWriter
# ------------

class OutputWriter (object) :
    def write (self, *a) :
        for w in a :
            print w,
        print

# -------
# my_read
# -------

def my_read (r) :
    """
    reads an int into p
    return true if that succeeds, false otherwise
    """
    global p
    try :
         p = int(r.read())
    except EOFError :
        return False
    return True

# -------
# my_eval
# -------

def my_eval () :
    """ 
    Computes the sum of four primes that equal p.
    Requires p <= 10000000.
    Returns with primes[0...3] filled with four primes that sum to p if possible.
    If not possible, fills primes[3] with -1
    """

    global primes, checkPrimes, p, primeDif

    #p is said to be less than or equal to 10M
    assert p <= 10000000
    #if this doesnt get reset then we know we didnt find a prime
    primes[3] = -1

    #if p is less than 8 then we cant find the primes so we know what to print later
    if p < 8:
        assert primes[3] == -1
        return

    #largest gap in between two primes is 159, so find a prime between p-6 and p-159
    for i in range(6,160) :
        if is_prime(p-i) :
            #we found a prime, not set the variables for the print function
            primes[0] = p-i
            primes[1] = primeDif[i][0]
            primes[2] = primeDif[i][1]
            primes[3] = primeDif[i][2]
            #assert that the primes add up to p
            assert p == primes[0] + primes[1] + primes[2] + primes[3]
            return

# --------
# my_print
# --------

def my_print (w) :
    """
    writes the values of the four primes that make up the given input
    writes "Impossible." if the input cannot be expressed as the sum of four primes
    """
    global primes

    if primes[3] == -1 :
        w.write("Impossible.")
    else:
        w.write(primes[0], primes[1], primes[2], primes[3] )


#---------
# is_prime
#---------

def is_prime(n) :
    """
    Checks if the passed in number is prime. If so return true, else false. 
    N must be <= 10000000
    """
    global checkPrimes

    assert n <= 10000000

    #checkPrimes is an array with all the primes from 2 to sqrt(10000000)
    #if any prime in this range devides n, n is not a prime.
    for k in checkPrimes:
        if (n % k)==0 :
            if k == n :
                return True
            return False
  
    return True
 

# ----
# main
# ----


def main () :
    """
    Reads from stdin and calls my_eval on input.
    Outputs to stdout
    """
    while my_read(InputReader()) :
       my_eval()
       my_print(OutputWriter())

if __name__ == "__main__" :
    main()
